// Definition for a binary tree node.
function TreeNode(val, left, right) {
  this.val = (val === undefined ? 0 : val)
  this.left = (left === undefined ? null : left)
  this.right = (right === undefined ? null : right)
}

function createTree(arr) {
  if (arr.length < 1)
    return null;
  let NodeArr = [];
  for (let i = 0; i < arr.length; i++) {
    if (arr[i] == null) {
      NodeArr.push(null);
      continue;
    }
    let tempNode = new TreeNode(arr[i], null, null);
    NodeArr.push(tempNode);
  }
  for (let i = 0; i < arr.length; i++) {
    if (NodeArr[i] == null) continue;
    if (2 * i + 1 < arr.length)
      NodeArr[i].left = NodeArr[2 * i + 1];
    if (2 * i + 2 < arr.length)
      NodeArr[i].right = NodeArr[2 * i + 2];
  }
  return NodeArr[0];
}

function preShow(node) {
  if (node == null)
    return;
  console.log(node.val);
  preShow(node.left);
  preShow(node.right);
}

/**
 * @param {TreeNode} root
 * @return {number}
 */
var subtreeWithAllDeepest = function (root) {
  root = createTree(root);
  function dfs(node) {
    if(!node) return 0;
    let right = dfs(node.right), left = dfs(node.left);
    return Math.max(right, left) + 1
  }
  if(root == null) return root;
  let left = dfs(root.left), right = dfs(root.right);
  if(left == right) return root;
  if(right > left) {
    return subtreeWithAllDeepest(root.right);
  } else {
    return subtreeWithAllDeepest(root.left);
  }
};
let root = [1,null,3,2,4,null,null,null,5];
root = [1,4,5,4,4,null,5];
console.log(subtreeWithAllDeepest(root));

